An Efficient Parallel Algorithm for Polygons Overlay Analysis

An Efficient Algorithm for Boolean Operation on Circular-arc Polygons

In this paper, we investigate the problem of Boolean operation on circular-arc polygons. We present a concise and efficient method, in which the concept of related edges is introduced. Given two circular-arc polygons with M and N edges, respectively, the proposed method only takes O((l+k)∗ log l+M +N) time, where k is the number of intersection points, l is the number of related edges. The prop...

An Efficient Parallel Biconnectivity Algorithm

A Subscription Overlay Network for Efficient File Parallel Downloading

This paper presents a subscription-based overlay network that supports efficient file parallel downloading. First, the system lets users register to a central server and allows the server to incrementally build a topology graph containing the network connections among the subscribers. With this topology graph in place, we address the challenges of minimizing network traffic and choosing the set...

An Efficient Parallel Block-Reduction Algorithm

In this paper, we present a new parallel block-reduction algorithm for reducing lattice bases which allows the use of an arbitrarily chosen block-size between two and n where n denotes the dimension of the lattice. Thus, we are building a hierarchy of parallel lattice basis reduction algorithms between the known parallel all-swap algorithm which is a parallelization for block-size two and the r...

An efficient parallel termination detection algorithm

In this paper, we present a new, easy to implement algorithm for detecting the termination of a parallel asynchronous computation on distributedmemory MIMD computers. We demonstrate that it operates concurrently with the main computation, adding minimal overhead, and we prove that it correctly detects termination when it occurs. Experimental results confirm that the termination detection routin...